home *** CD-ROM | disk | FTP | other *** search
- /* Copyright, 1990, Regents of the University of Colorado */
- #include "D_lib.h"
-
- D_recv_no_storage(){};
-
-
- #if (D_MACH == D_CUBE)
-
- #if D_HOST
- int Note_time(i_start){return 0;};
- #else
- static long dummy[20];
- long *timer_array=dummy, prof1b, prof2b;
- int Note_time(i_start) /*return last stop value for stacking*/
- int i_start;
- {
- static int i_stop = -1;
- int reg;
- long t;
-
- stop_timing(&t);
- if (i_start>=0)
- timer_array[i_start]-=t;
- if (i_stop>=0)
- timer_array[i_stop]+=t;
- reg = i_stop;
- i_stop = i_start;
- return reg;
- }
-
- start_timing()
- {
- prof1b=clock();
- }
- stop_timing(p)
- long *p;
- {
- prof2b=clock();
- *p=prof2b - prof1b;
- }
- #endif
- #else
- start_timing(){}
- Note_time(a)int a;{}
- long *timer_array;
- #endif
-
- /* moved ginv to route.c, & made it static so it wouldn't clash with
- the ipsc2 simulator */
-
- /* ginv(n)
- int n;
- */
- /*
-
- ginv = inverse of gray function
-
- answers the inevitable question, what task is being
- carried out on node n?
- */
-
- /*
- {
- int i, t;
- t = n/2;
- i = n;
- while(t != 0)
- {
- i = i^t;
- t = t/2;
- }
- return(i);
- }
-
- */
-